Deadlock-free traffic control with geometrical critical sections

نویسندگان

  • Albert L. Schoute
  • Peter J. Bouwens
چکیده

Traffic control of vehicles on pre-planned paths may be based on critical sections where vehicles have to control their velocity mutually in order to avoid collisions. By analysing the geometry of critical sections carefully deadlock situations can be recognised and situations where vehicles may share a critical area under certain restrictions to speed-up their passage. Deadlock-freeness can be guaranteed by applying a variant of the bankers algorithm. The traffic control strategy is applied within the ‘Mobile Autonomous Robot Twente’-project in which mobile assembly robots will drive around in a ‘factory of the future’ guided by software control.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Development of Maximum Likelihood Estimation Approaches for Adaptive Estimation of Free Speed and Critical Density in Vehicle Freeways

The performance of many traffic control strategies depends on how much the traffic flow models have been accurately calibrated. One of the most applicable traffic flow model in traffic control and management is LWR or METANET model. Practically, key parameters in LWR model, including free flow speed and critical density, are parameterized using flow and speed measurements gathered by inductive ...

متن کامل

The Development of Maximum Likelihood Estimation Approaches for Adaptive Estimation of Free Speed and Critical Density in Vehicle Freeways

The performance of many traffic control strategies depends on how much the traffic flow models are accurately calibrated. One of the most applicable traffic flow model in traffic control and management is LWR or METANET model. Practically, key parameters in LWR model, including free flow speed and critical density, are parameterized using flow and speed measurements gathered by inductive loop d...

متن کامل

A minimal property for characterizing deadlock-free programs

A fundamental issue in the development of concurrent programs is the resource allocation problem. Roughly speaking, it consists of providing some mechanism to avoid race conditions in the access of shared resources by two or more concurrent processes. For such a task, maybe the most widely mechanism consists of using critical sections. Unfortunately, it is also widely-known that programs which ...

متن کامل

Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches

ÐCut-through switching promises low latency delivery and has been used in new generation switches, especially in high speed networks demanding low communication latency. The interconnection of cut-through switches provides an excellent network platform for high speed local area networks (LANs). For cost and performance reasons, irregular topologies should be supported in such a switch-based net...

متن کامل

Designing a Deadlock-Free Train Scheduler: A Model Checking Approach

In this paper we present the approach used in the design of the scheduling kernel of an Automatic Train Supervision system (ATS). A formal model of the railway layout and of the expected service has been used to identify all the possible critical sections of the railway layout in which a deadlock might occur. For each critical section, the prevention of the occurrence of deadlocks is achieved b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002